Small Group Divisible Steiner Quadruple Systems
نویسندگان
چکیده
Melissa Keranen∗, Donald Kreher, Artem Zhuravlev, Michigan Technological University A group divisible Steiner quadruple system, is a triple (X,H,B) where X is a v-element set of points, H = {H1, H2, . . . , Hr} is a partition of X into holes and B is a collection of 4-element subsets of X called blocks such that every 3-element subset is either in a block or a hole but not both. We investigate the existence and non-existence of these designs. We settle all parameter situations on at most 24 points, with 6 exceptions. A uniform group divisible Steiner quadruple system is a system in which all the holes have equal size. These were called G-designs by Mills, and their existence is completely settled.
منابع مشابه
Almost simple groups with socle Ln(q) acting on Steiner quadruple systems
Let N = Ln(q), n ≥ 2, q a prime power, be a projective linear simple group. We classify all Steiner quadruple systems admitting a group G with N ≤ G ≤ Aut(N). In particular, we show that G cannot act as a group of automorphisms on any Steiner quadruple system for n > 2.
متن کاملConstructions for Steiner quadruple systems with a spanning block design
A singular direct product construction is presented for Steiner quadruple systems with a spanning block design. More constructions are also provided using Steiner systems S(3; k; v) and other designs. Small orders for v = 40 and 52 are constructed directly. Some in1nite classes of orders are also obtained. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملSteiner triple ( quadruple ) systems of small ranks embedded into perfect ( extended perfect ) binary codes 1
It is shown that a class of Steiner triple systems of order 2−1, obtained by some special switchings from the Hamming Steiner triple system, is embedded into some perfect code, constructed by known switchings of ijk-components from the binary Hamming code. The number of Steiner triple systems of order n and rank less or equal n− log(n + 1) + 2, embedded into perfect binary codes of length n, is...
متن کاملThe last twenty orders of (1, 2)-resolvable Steiner quadruple systems
A Steiner quadruple system (X, B) is said to be (1, 2)-resolvable if its blocks can be partitioned into r parts such that each point of X occurs in exactly two blocks in each part. The necessary condition for the existence of (1, 2)-resolvable Steiner quadruple systems RSQS(1, 2, v)s is v ≡ 2 or 10 (mod 12). Hartman and Phelps in [A. Hartman, K.T. Phelps, Steiner quadruple systems, in: J.H. Din...
متن کاملConstructions for generalized Steiner systems GS (3, 4, v , 2)
Generalized Steiner systems GS (3, 4, v, 2) were first discussed by Etzion and used to construct optimal constant weight codes over an alphabet of size three with minimum Hamming distance three, in which each codeword has length v and weight four. Not much is known for GS (3, 4, v, 2)s except for a recursive construction and two small designs for v = 8, 10 given by Etzion. In this paper, more s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008